Inverse parametric convex programming problems via convex liftings
نویسندگان
چکیده
منابع مشابه
Inverse parametric convex programming problems via convex liftings
The present paper introduces a procedure to recover an inverse parametric linear or quadratic programming problem from a given polyhedral partition over which a continuous piecewise affine function is defined. The solution to the resulting parametric linear problem is exactly the initial piecewise affine function over the given original parameter space partition. We provide sufficient condition...
متن کاملA Parametric Successive Underestimation Method for Convex Programming Problems with an Additional Convex Multiplicative Constraint
A bstract This paper addresses itself to an algorithm for a convex minimization problem with an additional convex multiplicative constraint. A convex multiplicative constraint is such that a product of two convex functions is less than or equal to some constant. It is shown that this non convex problem can be solved by solving a sequence of convex programming problems. The basic idea of this al...
متن کاملNonparametric Estimation via Convex Programming
In the paper, we focus primarily on the problem of recovering a linear form g x of unknown “signal” x known to belong to a given convex compact set X ⊂ R from N independent realizations of a random variable ι taking values in a finite set, the distribution p of ι being affinely parameterized by x: p = Ax + b. With no additional assumptions on X and A, we develop minimax optimal, within an absol...
متن کاملDynamic Programming via Convex Optimization
It has long been known that a wide class of problems in optimal control can be stated as infinite-dimensional convex optimization problems, where the Bellman equation is relaxed to inequality. In this paper we continue our recent efforts to show how this formulation can be used for numerical computation of optimal cost functions and control laws. In particular, we discuss new forms of discretiz...
متن کاملAnchored Regression: Solving Random Convex Equations via Convex Programming
We consider the problem of estimating a solution to (random) systems of equations that involve convex nonlinearities which has applications in machine learning and signal processing. Conventional estimators based on empirical risk minimization generally lead to non-convex programs that are often computationally intractable. We propose anchored regression, a new approach that utilizes an anchor ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2014
ISSN: 1474-6670
DOI: 10.3182/20140824-6-za-1003.02364